Two classes of q-ary codes based on group divisible association schemes

Two classes of q-ary codes based on group divisible association schemes

By means of Hall's Marriage Theorem, a class of q-ary codes are obtained through block designs based on group divisible association schemes with two associate classes. If these block designs are further semiframes, another class of q-ary codes are also constructed. @ 1999 Elsevier Science B.V. All rights reserved

New completely regular q-ary codes based on Kronecker products

For any integer ρ ≥ 1 and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d = 3 and with covering radius ρ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius ρ,...

On new completely regular q-ary codes

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

Nonequivalent q-ary Perfect Codes

Prefixless q-ary Balanced Codes

We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information on the balancing index. Lookup tables for coding and decoding the prefix are avoided. Index Terms Constrained code, balanced code, running digital sum, Knuth code, error correction.